On the Cell Probe Complexity of Polynomial Evaluation
نویسنده
چکیده
We consider the cell probe complexity of the polynomial evaluation problem with preprocessing of coeecients, for polynomials of degree at most n over a nite eld K. We show that the trivial cell probe algorithm for the problem is optimal if K is suuciently large compared to n. As an application, we give a new proof of the fact that P 6 = incr-TIME(o(log n= log log n)).
منابع مشابه
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof system for the cell-probe model, which describes verifications instead of computations in the cell-probe model. We present a combinatorial characterization of CPP. With this novel tool, we prove the following lower bounds for the nondeterministic cell-probe complexity of ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملSPION Conjugated Curcumin Nano-Imaging Probe: Synthesis and Bio-Physical Evaluation
In this work, we investigate the loading and conjugation of Curcumin on oleic acid (OA) and citric acid (CA) functionalized iron oxide nanoparticles and its applications in improving contrast in MRI. Magnetic iron oxide nanoparticles (Fe3O4, MNPs) synthesized using the co-precipitation method and characterized by XRD, DLS, FT-IR, VSM and SEM. FT-IR results confirmed functionalization with oleic...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 143 شماره
صفحات -
تاریخ انتشار 1995